The importance of smaller veteran trees

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Trees with Smaller Harmonic Indices

The harmonic index H (G) of a graph G is defined as the sum of the weights 2 du+dv of all edges uv of G, where du denotes the degree of a vertex u in G. In this paper, we determine (i) the trees of order n and m pendant vertices with the second smallest harmonic index, (ii) the trees of order n and diameter r with the smallest and the second smallest harmonic indices, and (iii) the trees of ord...

متن کامل

Counting smaller trees in the Tamari order

We introduce new combinatorial objects, the interval-posets, that encode intervals of the Tamari lattice. We then find a combinatorial interpretation of the bilinear form that appears in the functional equation of Tamari intervals described by Chapoton. Thus, we retrieve this functional equation and prove that the polynomial recursively computed from the bilinear form on each tree T counts the ...

متن کامل

Comparing the Lifestyle of Veteran and Non-Veteran Families in Tehran

Introduction: Lifestyle of a community members should be investigated, especially in the devotees and their families. The present research aimed at measuring and comparing the lifestyle status of veteran and non-veteran families in Iran. Methods: In this cross-sectional study, the statistical population included the veteran and non-veteran families in Tehran City and the sample size included 3...

متن کامل

QP tries are smaller and faster than crit-bit trees

A trie data structure stores an ordered set of keys; the branching structure of a trie depends on the lexical properties of its keys independent of the order of insertion. Compact implementations of PATRICIA binary tries called crit-bit trees [2] have just two words of overhead per item stored. A hash array mapped trie (HAMT) [1] has wide fan-out, indexing each tree node using several hashed ke...

متن کامل

Variable Importance Using Decision Trees

Decision trees and random forests are well established models that not only offer good predictive performance, but also provide rich feature importance information. While practitioners often employ variable importance methods that rely on this impurity-based information, these methods remain poorly characterized from a theoretical perspective. We provide novel insights into the performance of t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Arboricultural Journal

سال: 2017

ISSN: 0307-1375,2168-1074

DOI: 10.1080/03071375.2017.1405569